A Compression Algorithm for Probability Transition Matrices
نویسنده
چکیده
This paper describes a compression algorithm for probability transition matrices. The compressed matrix is itself a probability transition matrix. In general the compression is not error-free, but the error appears to be small even for high levels of compression.
منابع مشابه
فشرده سازی اطلاعات متغیر با زمان با استفاده از کد هافمن
Abstract: In this paper, we fit a function on probability density curve representing an information stream using artificial neural network . This methodology result is a specific function which represent a memorize able probability density curve . we then use the resulting function for information compression by Huffman algorithm . the difference between the proposed me then with the general me...
متن کاملDetection of Shifted Double JPEG Compression using Markovian Transition Probability Matrix
Copy-paste forgery is a very common type of forgery in JPEG images. The tampered patch has always suffered from JPEG compression twice with inconsistent block segmentation. This phenomenon in JPEG image forgeries is called the shifted double JPEG (SD-JPEG) compression. Detection of SD-JPEG compressed blocks can make crucial contribution to detect and locate the tampered region. However, the exi...
متن کاملComparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice
A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...
متن کاملLocation Prediction Based on Transition Probability Matrices Constructing from Sequential Rules for Spatial-Temporal K-Anonymity Dataset
Spatial-temporal k-anonymity has become a mainstream approach among techniques for protection of users' privacy in location-based services (LBS) applications, and has been applied to several variants such as LBS snapshot queries and continuous queries. Analyzing large-scale spatial-temporal anonymity sets may benefit several LBS applications. In this paper, we propose two location prediction me...
متن کاملTurbo Source Coding: A Noise-Robust Approach to Data Compression
All traditional data compression techniques, such as Huffman coding, the Lempel-Ziv algorithm, run-length limited coding, Tunstall coding and arithmetic coding are highly susceptible to residual channel errors and noise. We have recently proposed the use of parallel concatenated codes and iterative decoding for fixed-length to fixed-length source coding, i.e., turbo coding for data compression ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 20 شماره
صفحات -
تاریخ انتشار 1998